Exact Isosurfaces for Marching Cubes

نویسنده

  • Holger Theisel
چکیده

In this paper we study the exact contours of a piecewise trilinear scalar field. We show how to represent these contours exactly as trimmed surfaces of triangular rational cubic Bézier patches. As part of this, we introduce an extension of the marching cubes algorithm which gives a topologically exact triangular approximation of the contours for any case. Finally, we modify the exact contours to be globally G1 continuous without changing their topologies. We test the algorithm on both theoretical and practical data sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive cube tessellation for topologically correct isosurfaces

Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...

متن کامل

Isosurfaces on Optimal Regular Samples

Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several different algorithms. Since the mesh that arises from BCC lattices involves a large number of cells, we show two alternate methods of reducing the number of cells by clumping tetrahedra into either octahedra or hexahedr...

متن کامل

On Marching Cubes

A characterization and classification of the isosurfaces of trilinear functions is presented. Based upon these results, a new algorithm for computing a triangular mesh approximation to isosurfaces for data given on a 3D rectilinear grid is presented. The original marching cubes algorithm is based upon linear interpolation along edges of the voxels. The asymptotic decider method is based upon bi...

متن کامل

Improved marching cubes using novel adjacent lookup table and random sampling for medical object-specific 3D visualization

The marching cubes (MC) algorithm is a widely used routine to extract isosurfaces from volumetric data set. This method suffers from the exhaustive accessing cubes sequentially and the failure of directly separating the isosurfaces. To address this, an improved MC algorithm called AlutMC is proposed to track connected surfaces by combining a new adjacent lookup table and random sampling techniq...

متن کامل

Marching Correctors – Fast and Precise Polygonal Isosurfaces of SPH Data

This paper presents the first method for isosurface extraction from smoothed particle hydrodynamics (SPH) data that is exact with respect to the functional representation provided by SPH. The Marching Correctors algorithm is an extension of the Marching Cubes algorithm which is adapted to the SPH representation and avoids resampling to a full grid. The algorithm operates on a virtual grid of su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2002